Partial Evaluation of General Parsers – Slightly Revised

نویسنده

  • Christian Mossin
چکیده

Applications of partial evaluation have so far mainly focused on generation of compilers from interpreters for programming languages. We partially evaluate a simple general LR(k) parsing algorithm. To obtain good results, we rewrite the algorithm using a number of binding-time improvements. The final LR(1) parser has been specialized using Similix, a partial evaluator for a higher order subset of Scheme [3]. The obtained specialized parsers are efficient and compact. Partial evaluation is responsible for the (equivalent of) the sets-of-items construction, and the construction of parsing tables. This paper is an extended abstract of [14].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of Dependency Parsers on Unbounded Dependencies

We evaluate two dependency parsers, MSTParser and MaltParser, with respect to their capacity to recover unbounded dependencies in English, a type of evaluation that has been applied to grammarbased parsers and statistical phrase structure parsers but not to dependency parsers. The evaluation shows that when combined with simple post-processing heuristics, the parsers correctly recall unbounded ...

متن کامل

Deterministic, Error-Correcting Combinator Parsers

We show how error-correcting, deterministic, combinator parsers can be constructed for grammars which have the LL(1) property. The normal disadvantages of conventional combinator parsers, such as their lack of speed and their poor error reporting, are remedied. Parsers constructed with these combinators are implicitly specialised for the grammar they describe. Because of this property the combi...

متن کامل

An approach to Robust Partial Parsing and Evaluation Metrics

In this paper, we present a new technique called Lightweight Dependency Analysis which in conjunctionwith Supertag disambiguation provides a method for Robust Partial Parsing, called Almost Parsing. An overview is given of the XTAG system in which this technique is being developed. In addition, we propose alternate metrics for evaluation of partial parsers that can also serve to evaluate full p...

متن کامل

Towards a Dependency-Oriented Evaluation for Partial Parsing

Quantitative evaluation of parsers has traditionally centered around the PARSEVAL measures of crossing brackets, (labeled) precision, and (labeled) recall. However, it is well known that these measures do not give an accurate picture of the quality of the parser’s output. Furthermore, we will show that they are especially unsuited for partial parsers. In recent years, research has concentrated ...

متن کامل

Explanation-Based Learning of Partial-Parsers

This paper presents a method for learning eecient parsers of natural language. The method consists of an Explanation-Based Learning (EBL) algorithm for learning partial-parsers, and a parsing algorithm which combines partial-parsers with existing \full-parsers". The learned partial-parsers, implementable as Cascades of Finite State Transducers (CFSTs), recognize and combine constituents eecient...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005